Research on Flexible Job Shop Scheduling Problem Based on Improved Genetic Algorithm
نویسندگان
چکیده
منابع مشابه
Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملGenetic algorithm for the flexible job-shop scheduling problem
In this paper, we propose a new optimization technique, the hierarchical multi-space competitive distributed genetic algorithm (HmcDGA), which is effective for the hierarchical optimization problem. It is an extension of the multi-space competitive distributed genetic algorithm (mcDGA), which was proposed by the authors. The mcDGA efficiently finds an optimal solution with a low computational c...
متن کاملAn Improved Genetic Algorithm for Multi-objective Flexible Job-shop Scheduling Problem
Flexible job shop scheduling problem (FJSP) is an extended traditional job shop scheduling problem, which more approximates to real scheduling problems. This paper presents a multi-objective genetic algorithm (GA) based on immune and entropy principle to solve the multi-objective FJSP. In this improved multi-objective GA, the immune and entropy principle is used to keep the diversity of individ...
متن کاملAn Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem
The Distributed and Flexible Job-shop Scheduling problem (DFJS) considers the scheduling of distributed manufacturing environments, where jobs are processed by a system of several Flexible Manufacturing Units (FMUs). Distributed scheduling problems deal with the assignment of jobs to FMUs and with determining the scheduling of each FMU, in terms of assignment of each job operation to one of the...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Engineering and Technology Research
سال: 2017
ISSN: 2475-885X
DOI: 10.12783/dtetr/mdm2016/4877